On the topological equivalence of the Arrow impossibility theorem and Amartya Sen's liberal paradox
نویسنده
چکیده
We will show that the Arrow impossibility theorem for binary social choice rules that there exists no binary social choice rule which satisfies transitivity, Pareto principle, independence of irrelevant alternatives (IIA), and has no dictator, and Amartya Sen’s liberal paradox for binary social choice rules that there exists no binary social choice rule which satisfies acyclicity, Pareto principle and the minimal liberalism are topologically equivalent using elementary tools of algebraic topology such as homomorphisms of homology groups of simplicial complexes induced by simplicial mappings. Our research is in line with the studies of topological approaches to discrete social choice problems initiated by [Y. Baryshnikov, Unifying impossibility theorems: a topological approach, Advances in Applied Mathematics 14 (1993) 404–415]. Also we will show that these two theorems are special cases of the theorem that there exists no binary social choice rule which satisfies Pareto principle and the non-surjectivity of individual inclusion mappings. 2006 Elsevier Inc. All rights reserved.
منابع مشابه
The Impossibility of a Paretian Republican?
Philip Pettit (2001) has suggested that there are parallels between his republican account of freedom and Amartya Sen’s (1970) account of freedom as decisive preference. In this paper, I discuss these parallels from a social-choice-theoretic perspective. I sketch a formalization of republican freedom, and argue that republican freedom is formally very similar to freedom as defined in Sen’s “min...
متن کاملThe impossibility of a Paretian republican? Some comments on Pettit and Sen
Philip Pettit (2001) has suggested that there are parallels between his republican account of freedom and Amartya Sen’s (1970) account of freedom as decisive preference. In this paper, I discuss these parallels from a social-choice-theoretic perspective. I sketch a formalization of republican freedom, and argue that republican freedom is formally very similar to freedom as defined in Sen’s “min...
متن کاملThe Hex Game Theorem and the Arrow Impossibility Theorem: the Case of Weak Orders
The Arrow impossibility theorem when individual preferences are weak orders is equivalent to the HEX game theorem. Because Gale showed that the Brouwer fixed point theorem is equivalent to the HEX game theorem, this paper indirectly shows the equivalence of the Brouwer fixed point theorem and the Arrow impossibility theorem. Chichilnisky showed the equivalence of her impossibility theorem and t...
متن کاملArrow theorems in the fuzzy setting
Throughout this paper, our main idea is to analyze the Arrovian approach in a fuzzy context, paying attention to different extensions of the classical Arrow's model arising in mathematical Social Choice to aggregate preferences that the agents define on a set of alternatives. There is a wide set of extensions. Some of them give rise to an impossibility theorem as in the Arrovian classical mod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 181 شماره
صفحات -
تاریخ انتشار 2006